Regularization Path Algorithms for Detecting Gene Interactions
نویسندگان
چکیده
In this study, we consider several regularization path algorithms with grouped variable selection for modeling gene-interactions. When fitting with categorical factors, including the genotype measurements, we often define a set of dummy variables that represent a single factor/interaction of factors. Yuan & Lin (2006) proposed the groupLars and the group-Lasso methods through which these groups of indicators can be selected simultaneously. Here we introduce another version of group-Lars. In addition, we propose a path-following algorithm for the group-Lasso method applied to generalized linear models. We then use all these path algorithms, which select the grouped variables in a smooth way, to identify gene-interactions affecting disease status in an example. We further compare their performances to that of L2 penalized logistic regression with forward stepwise variable selection discussed in Park & Hastie (2006b).
منابع مشابه
A New Generalized Error Path Algorithm for Model Selection
Model selection with cross validation (CV) is very popular in machine learning. However, CV with grid and other common search strategies cannot guarantee to find the model with minimum CV error, which is often the ultimate goal of model selection. Recently, various solution path algorithms have been proposed for several important learning algorithms including support vector classification, Lass...
متن کاملExploring the Entire Regularization Path for the Asymmetric Cost Linear Support Vector Machine
We propose an algorithm for exploring the entire regularization path of asymmetric-cost linear support vector machines. Empirical evidence suggests the predictive power of support vector machines depends on the regularization parameters of the training algorithms. The algorithms exploring the entire regularization paths have been proposed for single-cost support vector machines thereby providin...
متن کاملLeaning Graphical Model Structures using L1-Regularization Paths (addendum)
– The LARS-MLE algorithm, an efficient algorithm that returns the unpenalized Maximum Likelihood Estimates (MLEs) for all non-zero subsets of variables encountered along the LARS regularization path. – The Two-Metric Projection algorithm used for L1-regularized Logistic Regression. – The L1PC algorithm, a relaxed form of the L1MB algorithm that allows scaling to much larger graphs. – Extensions...
متن کاملAn Exponential Lower Bound on the Complexity of Regularization Paths
For a variety of regularization methods, algorithms computing the entire solution path have been developed recently. Solution path algorithms do not only compute the solution for one particular value of the regularization parameter but the entire path of solutions, making the selection of an optimal parameter much easier. It has been assumed that these piecewise linear solution paths have only ...
متن کاملApproximate Regularization Paths for `2-loss Support Vector Machines
We consider approximate regularization paths for kernel methods and in particular `2-loss Support Vector Machines (SVMs). We provide a simple and efficient framework for maintaining an εapproximate solution (and a corresponding ε-coreset) along the entire regularization path. We prove correctness and also practical efficiency our method. Unlike previous algorithms our algorithm does not need an...
متن کامل